CSE 393 Concurrent and Distributed Algorithms
نویسنده
چکیده
The distinction can be conceptual, like in multi-player games: players can be physically and geographically distributed but connected to a server and seeing the shared state of the game, or physically together but communicate following certain rule and not seeing each other's state. Indeed a system can have both aspects at the same time, with some data shared, and some data private. In general, it is helpful to think of these systems as multi-agent systems. What they need fundamentally, going beyond centralized sequential systems, is the ability to communicate and synchronize.
منابع مشابه
Towards Computer-Supported Collaborative Software Engineering
Software engineering is a fundamentally collaborative activity, yet most tools that support software engineers are designed only for single users. There are many foreseen benefits in using tools that support real time collaboration between software engineers, such as avoiding conflicting concurrent changes to source files and determining the impact of program changes immediately. Unfortunately,...
متن کاملOn the relationships between commercial sexual exploitation/prostitution, substance dependency, and delinquency in youthful offenders.
Researchers have consistently linked commercial sexual exploitation (CSE) of youth and involvement in prostitution with substance dependency and delinquency. Yet, important questions remain regarding the directionality and mechanisms driving this association. Utilizing a sample of 114 CSE/prostituted youth participating in the Pathways to Desistance study-a longitudinal investigation of the tra...
متن کاملA Scalable Distributed Search Engine for Fresh Information Retrieval
We have developed a distributed search engine, Cooperative Search Engine (CSE) to retrieve fresh information. In CSE, a local search engine located in each web server makes an index of local pages. And, a Meta search server integrates these local search engines to realize a global search engine. In such a way, the communication delay occurs at retrieval. So, we have developed several speedup te...
متن کاملAlgorithmic Control in Concurrent Computations
In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in a network can function independently, their interaction is usually subjected to definite rules. These rules often form algorithms of interaction for distributed systems and devices. The main goal is to understand how c...
متن کاملFully Dynamic Randomized Algorithms for Graph Spanners in Centralized as well as Distributed environments∗
Spanner of an undirected graph G = (V, E) is a sub graph which is sparse and yet preserves all-pairs distances approximately. More formally, a spanner with stretch t ∈ N is a subgraph (V, ES), ES ⊆ E such that the distance between any two vertices in the subgraph is at most t times their distance in G. We present two randomized algorithms for maintaining a sparse t-spanner of an undirected unwe...
متن کامل